A Trust Routing for Multimedia Social Networks
نویسندگان
چکیده
Due to the disconnected and store-and-forward architecture in multimedia social networks (MSNs), routing becomes a great challenge with the frequent path disruptions. Moreover, some nodes in MSNs tend to be selfish or malicious, e.g. they sometimes will not forward packets for other nodes or will launch passive and active attacks in order to save their limited resources such as bandwidth, battery or storage. In order to address this issue, we propose a fuzzy-based trust management technique for context-based routing in MSNs. We incorporate social trust metrics and quality of service metrics into our trust model. By adopting fuzzy sets, every node can evaluate the credibility of other nodes based on the direct and indirect relationship. By ranking all its neighbors according to the trust values, each node can purge untrustworthy nodes. Since only trusted nodes’ packets will be forwarded, the selfish or malicious nodes have the incentive to behave well again in order to be able to send packets. Additionally, we perform extensive security and performance evaluation with the opportunistic network environment simulator. The simulation results show that our trust model can dynamically update the trust value in real time, effectively measure the trust relationship and correctly identify malicious or selfish nodes. Furthermore, the proposed trust routing is a lightweight protocol balancing the message overhead and delivery ratio.
منابع مشابه
A New Framework for Secure Routing in VANET
Vehicular Ad-Hoc Networks can enhance road safety and enable drivers to avoid different threats. Safety applications, mobile commerce, and other information services are among different available services that are affected by dynamic topology, vehicle’s speed and node misbehaving. Dynamic topology makes the route unstable and unreliable. So, improving the throughput and performance of VANET thr...
متن کاملA Survey on Multicast Routing Approaches in Wireless Mesh Networks
Wireless mesh networks (WMNs) which mediates the broadband Internet access, have been recently received many attentions by the researchers. In order to increase capacity in these networks, nodes are equipped with multiple radios tuned on multiple channels emerging multi radio multi-channel WMNs (MRMC WMNs). Therefore, a vital challenge that poses in MRMC WMNs is how to properly assign channels ...
متن کاملMulticast computer network routing using genetic algorithm and ant colony
Due to the growth and development of computer networks, the importance of the routing topic has been increased. The importance of the use of multicast networks is not negligible nowadays. Many of multimedia programs need to use a communication link to send a packet from a sender to several receivers. To support such programs, there is a need to make an optimal multicast tree to indicate the opt...
متن کاملTrust Integrated Congestion Aware Energy Efficient Routing forWireless Multimedia Sensor Networks (TCEER)
Congestion control and energy consumption in Wireless Multimedia Sensor Network is a new research subject which has been ushered in through the introduction of multimedia sensor nodes that are capable of transmitting large volume of high bit rate heterogeneous multimedia data. Most of the existing congestion control algorithms for Wireless Sensor Networks do not discuss the impact of security a...
متن کاملSPROUT: P2P Routing with Social Networks
In this paper, we investigate how existing social networks can benefit P2P data networks by leveraging the inherent trust associated with social links. We present a trust model that lets us compare routing algorithms for P2P networks overlaying social networks. We propose SPROUT, a DHT routing algorithm that, by using social links, significantly increases the number of query results and reduces...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. J.
دوره 58 شماره
صفحات -
تاریخ انتشار 2015